An Investigation of Messy Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Messy Genetic Algorithms for Subset Feature Selection
Subset Feature Selection problems can have several attributes which may make Messy Ge netic Algorithms an appropriate optimization method First competitive solutions may of ten use only a small percentage of the total available features this can not only o er an advantage to Messy Genetic Algorithms it may also cause problems for other types of evolutionary algorithms Second the evalu ation of ...
متن کاملA New Learning Method for the Design of Hierarchical Fuzzy Controllers Using Messy Genetic Algorithms
An automatic design method for fuzzy controllers with a hierarchical prioritized structure is proposed. A messy genetic algorithm is used to learn di erent types of behaviour which are represented by a hierarchical set of fuzzy rules. We demonstrate that messy genetic algorithms are well suited to the task of learning because they allow a exible representation of the hierarchical prioritized st...
متن کاملExtended Multi-objective fast messy Genetic Algorithm Solving Deception Problems
Deception problems are among the hardest problems to solve using ordinary genetic algorithms. Designed to simulate a high degree of epistasis, these deception problems imitate extremely difficult real world problems. [1]. Studies show that Bayesian optimization and explicit building block manipulation algorithms, like the fast messy genetic algorithm (fmGA), can help in solving these problems. ...
متن کاملAn Efficient Genetic Algorithm Paradigm for Discrete Optimisation of Pipeline Networks
Engineering and science disciplines make use of genetic algorithms. A number of genetic-based search paradigms have been developed and applied to different problems. A growing demand for algorithms to solve new problems and a never-ending process of designing algorithms strongly suggests the need for more efficient and more robust geneticbased optimisation techniques. Ideally these algorithms s...
متن کاملCompression of E ective Size in Genetic
We measure the compression of information in a genetic programming system. The investigation is performed taking introns in the genome into account. We mainly investigate evolution of linear computer code but also present results from evolution of tree structures as well as messy genetic algorithms. The size of solutions is an important property of any system trying to learn or adapt to its env...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990